Optimal Stopping Games for Markov Processes

نویسندگان

  • Erik Ekström
  • Goran Peskir
چکیده

where the horizon T (the upper bound for τ and σ above) may be either finite or infinite (it is assumed that G1(XT ) = G2(XT ) if T is finite and lim inft→∞G2(Xt) ≤ lim supt→∞G1(Xt) if T is infinite). If X is right-continuous, then the Stackelberg equilibrium holds, in the sense that V ∗(x) = V∗(x) for all x with V := V ∗ = V∗ defining a measurable function. If X is right-continuous and left-continuous over stopping times (quasi-left-continuous), then the Nash equilibrium holds, in the sense that there exist stopping times τ∗ and σ∗ such that

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Stopping of Markov Processes : Hilbert Space Theory , Approximation Algorithms , and an Application toPricing High { Dimensional Financial Derivatives 1

We develop a theory characterizing optimal stopping times for discrete-time ergodic Markov processes with discounted rewards. The theory di ers from prior work by its view of per-stage and terminal reward functions as elements of a certain Hilbert space. In addition to a streamlined analysis establishing existence and uniqueness of a solution to Bellman's equation, this approach provides an ele...

متن کامل

Optimal stopping of Markov processes: Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional financial derivatives

We develop a theory characterizing optimal stopping times for discrete-time ergodic Markov processes with discounted rewards. The theory differs from prior work by its view of per-stage and terminal reward functions as elements of a certain Hilbert space. In addition to a streamlined analysis establishing existence and uniqueness of a solution to Bellman's equation, this approach provides an el...

متن کامل

Utilizing Generalized Learning Automata for Finding Optimal Policies in MMDPs

Multi agent Markov decision processes (MMDPs), as the generalization of Markov decision processes to the multi agent case, have long been used for modeling multi agent system and are used as a suitable framework for Multi agent Reinforcement Learning. In this paper, a generalized learning automata based algorithm for finding optimal policies in MMDP is proposed. In the proposed algorithm, MMDP ...

متن کامل

[hal-00325406, v1] A class of optimal stopping problems for Markov processes

Our purpose is to study a particular class of optimal stopping problems for Markov processes. We justify the value function convexity and we deduce that there exists a boundary function such that the smallest optimal stopping time is the first time when the Markov process passes over the boundary depending on time. Moreover, we propose a method to find the optimal boundary function.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Control and Optimization

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2008